Asymptotic Delsarte cliques in distance-regular graphs

We give a new bound on the parameter λ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph G, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014). The new bound is one of the ingredients of recent progress on the complexity of testing isomorphism of strongly regular graphs (Babai, Chen, Sun, Teng, Wilmes 2013). The proof is based on a clique geometry found by Metsch (1991) under certain constraints on the parameters. We also give a simplified proof of the following asymptotic consequence of Metsch’s result: if kμ = o(λ) then each edge of G belongs to a unique maximal clique of size asymptotically equal to λ, and all other cliques have size o(λ). Here k denotes the degree and μ the number of common neighbors of a pair of vertices at distance 2. We point out that Metsch’s cliques are “asymptotically Delsarte” when kμ = o(λ), so families of distance-regular graphs with parameters satisfying kμ = o(λ) are “asymptotically Delsarte-geometric.”